ar X iv : 1 70 5 . 02 21 5 v 1 [ cs . I T ] 5 M ay 2 01 7 Resource Allocation for Secure Full - Duplex

نویسندگان

  • Yan Sun
  • Derrick Wing Kwan Ng
  • Robert Schober
چکیده

In this paper, we study the resource allocation for an orthogonal frequency division multiple access (OFDMA) radio system employing a full-duplex base station for serving multiple half-duplex downlink and uplink users simultaneously. The resource allocation design objective is the maximization of the weighted system throughput while limiting the information leakage to guarantee secure simultaneous downlink and uplink transmission in the presence of potential eavesdroppers. The algorithm design leads to a mixed combinatorial non-convex optimization problem and obtaining the globally optimal solution entails a prohibitively high computational complexity. Therefore, an efficient successive convex approximation based suboptimal iterative algorithm is proposed. Our simulation results confirm that the proposed suboptimal algorithm achieves a significant performance gain compared to two baseline schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sensitivity Properties of Intermittent Control

The sensitivity properties of intermittent control are analysed and the conditions for a limit cycle derived theoretically and verified by simulation. 1 ar X iv :1 70 5. 08 22 8v 1 [ cs .S Y ] 2 2 M ay 2 01 7

متن کامل

ar X iv : 1 10 5 . 29 42 v 2 [ cs . D S ] 1 7 M ay 2 01 1 Invitation to Algorithmic Uses of Inclusion – Exclusion

I give an introduction to algorithmic uses of the principle of inclusion–exclusion. The presentation is intended to be be concrete and accessible, at the expense of generality and comprehensiveness. R T 1 The principle of inclusion–exclusion. There are as many odd-sized as even-sized subsets sandwiched between two different sets: For R ⊆ T ,

متن کامل

ar X iv : 1 70 5 . 03 17 4 v 1 [ m at h . R T ] 9 M ay 2 01 7 PYRAMIDS AND 2 - REPRESENTATIONS

We describe a diagrammatic procedure which lifts strict monoidal actions from additive categories to categories of complexes avoiding any use of direct sums. As an application, we prove that every simple transitive 2-representation of the 2-category of projective bimodules over a finite dimensional algebra is equivalent to a cell 2-representation.

متن کامل

ar X iv : 1 70 5 . 07 33 9 v 1 [ cs . A I ] 2 0 M ay 2 01 7 Combining tabu search and graph reduction to solve the maximum balanced biclique problem

The Maximum Balanced Biclique Problem is a well-known graph model with relevant applications in diverse domains. This paper introduces a novel algorithm, which combines an effective constraint-based tabu search procedure and two dedicated graph reduction techniques. We verify the effectiveness of the algorithm on 30 classical random benchmark graphs and 25 very large real-life sparse graphs fro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017